Generalized Committed Choice
نویسندگان
چکیده
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations from different alternatives to occur concurrently and later commit to one of them. GCC generalizes the traditional committed choice in Dijkstra’s Guarded Command Language to handle don’t know non-determinism and also allows for speculative computation. The main contribution of the paper is to introduce the GCC programming construct and the associated semantics framework for formalizing GCC. We give some experimental results which show that the power of GCC can be made practical.
منابع مشابه
A Runtime System for Generalized Committed Choice
Traditional nondeterministic programming constructs (Dijkstra guards, CCP [6] and deep guards [10]) do not allow operations which modify the runtime environment without committing to a particular alternative. Generalized committed choice (GCC) allows speculative computations across different alternatives to execute in parallel and isolation. Speculation implicitly forks an environment into sepa...
متن کاملGeneralized Snapshot Isolation and a Prefix-Consistent Implementation
Generalized snapshot isolation extends snapshot isolation as used in Oracle and other databases in a manner suitable for replicated databases. While (conventional) snapshot isolation requires that transactions observe the “latest” snapshot of the database, generalized snapshot isolation allows the use of “older” snapshots, facilitating a replicated implementation. We show that many of the desir...
متن کاملOptimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem
In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...
متن کاملOptimizing Clause Matching Automata in Committed-choice Languages
We introduce a formalism for clause matching in concurrent committed-choice languages based on the construction of clause matching automata, a heuristic for the compilation of clause matching, and a technique for more eecient implementation of matches. The formalism is notable for its generality and simplicity, the heuristic for combining important advantages of several existing heuristics. The...
متن کاملImplicit commitment in theory choice
The proper evaluation of a theory’s virtues seems to require taking into account what the theory is indirectly or implicitly committed to, in addition to what it explicitly says. Most extant proposals for criteria of theory choice in the literature spell out the relevant notion of implicit commitment via some notion of entailment. I show that such criteria behave implausibly in application to t...
متن کامل